630_Course_Schedule_III.java

classSolution {
publicintscheduleCourse(int[][] courses) {
intn = courses.length;
if (n == 0)
return0;
Arrays.sort(courses, (a, b) -> a[1] - b[1]);
PriorityQueue<Integer> pq = newPriorityQueue<>((a, b) -> b - a);
intstart = 0;
for (int[] course : courses) {
start += course[0];
pq.offer(course[0]);
if (start > course[1]) {
start -= pq.poll();
 }
 }
returnpq.size();
 }
}